A bio-inspired optimization for inferring interactive networks: Cockroach swarm evolution

نویسندگان

  • Shinq-Jen Wu
  • Cheng-Tao Wu
چکیده

Most diseases are the result of interactions between gene products. Inferring the quantitatively dynamic interactive mechanisms of underlying systems has become a central part of the ongoing revolution in biology. Biological systems are sparely connected and always noise contaminated. The connection cannot be neglected even the strength is down to 0.001. Therefore, the used computational technologies are not only good in exploitation and exploration but also robust to noise. The development of effective topdownmodeling technologies to largely increase the gap between redundant and true connections is a significant challenge. Cockroaches are found in nearly all habitats and survive in extreme environments and when there is food scarcity. We previously introduced cockroaches’ competition behavior to improve GAs’ exploitation for the parameter estimation of biological systems. However, cockroaches always work together for foraging. Competition occurs only during food is extremely scarcity. In this study, we further mimick cockroaches’ cooperated-based swarm behavior, wherein their competitive behavior and migration are event-induced. The proposed cockroach-inspired swarm evolution (CSE) was tested through drylab experiments under noise environment. We successfully identified 80 connections (62 redundant and 18 true connections) with truncated interactive strengths smaller than 10 . Only one to three pruning steps for noise-free systems and five steps for noise-contaminated systems are needed even in a wide searching space. The estimated parameters are almost perfectly equal to the true ones. 2014 Elsevier Ltd. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bio-inspired optimization algorithms applied to rectenna design

*Correspondence: [email protected] Department of Electric engineering, Xi’an Jiaotong-Liverpool University, Ren’ai road 111, Suzhou, People’s Republic of China Abstract A comparative study of the use of bio-inspired optimization technologies including the Cuckoo Search (CS) algorithm, the Differential Evolution (DE) algorithm, and Quantum-behaved Particle Swarm Optimization (QPSO) in the ...

متن کامل

Investigation on Bio-Inspired Population Based Metaheuristic Algorithms for Optimization Problems in Ad Hoc Networks

Nature is a great source of inspiration for solving complex problems in networks. It helps to find the optimal solution. Metaheuristic algorithm is one of the nature-inspired algorithm which helps in solving routing problem in networks. The dynamic features, changing of topology frequently and limited bandwidth make the routing, challenging in MANET. Implementation of appropriate routing algori...

متن کامل

Investigation on Bio-Inspired Population Based Metaheuristic Algorithms for Optimization Problems in Ad Hoc Networks

Nature is a great source of inspiration for solving complex problems in networks. It helps to find the optimal solution. Metaheuristic algorithm is one of the nature-inspired algorithm which helps in solving routing problem in networks. The dynamic features, changing of topology frequently and limited bandwidth make the routing, challenging in MANET. Implementation of appropriate routing algori...

متن کامل

Swarm Intelligence Approach for Ad-Hoc Networks

Wireless ad-hoc networks are infrastructureless and they consist of nodes that come together and start communicating dynamically without requiring any backbone support. The nodes can enter and leave the network at will and can move about in the network at will. Ad-hoc networks present the perfect test-beds for bio-inspired computing algorithms. Both ad-hoc networks and bio-inspired computing ap...

متن کامل

A Review of Bio-inspired Algorithms for Vehicle Routing

This chapter reviews biologically inspired algorithms for solving a class of difficult combinatorial optimization problems known as vehicle routing problems, where least cost collection or delivery routes are designed to serve a set of customers in a transportation network. From a methodological standpoint, the review includes evolutionary algorithms, ant colony optimization, particle swarm opt...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Expert Syst. Appl.

دوره 42  شماره 

صفحات  -

تاریخ انتشار 2015